An Approach to Ordinal Classification Problems
نویسنده
چکیده
An ordinal classification task is defined. An approach to the construction of full ordinal classification on the basis of a decision maker’s knowledge is proposed. It allows elicitation of information (or knowledge) in a natural form for the decision maker (through qualitative attribute scales and verbal descriptions of decision classes). It provides verification of the received judgments for consistency and possibilities for corrections and modifications of the elicited classification rules. Problems with obtaining valid judgments from people in ordinal classification tasks are discussed. The decision support system ORCLASS, developed on the basis of the proposed approach, is described.
منابع مشابه
Unimodal Probability Distributions for Deep Ordinal Classification
Probability distributions produced by the crossentropy loss for ordinal classification problems can possess undesired properties. We propose a straightforward technique to constrain discrete ordinal probability distributions to be unimodal via the use of the Poisson and binomial probability distributions. We evaluate this approach in the context of deep learning on two large ordinal image datas...
متن کاملDeep Ordinal Regression Based on Data Relationship for Small Datasets
Ordinal regression aims to classify instances into ordinal categories. As with other supervised learning problems, learning an effective deep ordinal model from a small dataset is challenging. This paper proposes a new approach which transforms the ordinal regression problem to binary classification problems and uses triplets with instances from different categories to train deep neural network...
متن کاملLearning Rule Ensembles for Ordinal Classification with Monotonicity Constraints
Ordinal classification problems with monotonicity constraints (also referred to as multicriteria classification problems) often appear in real-life applications, however, they are considered relatively less frequently in theoretical studies than regular classification problems. We introduce a rule induction algorithm based on the statistical learning approach that is tailored for this type of p...
متن کاملLens Depth Function and k-Relative Neighborhood Graph: Versatile Tools for Ordinal Data Analysis
In recent years it has become popular to study machine learning problems based on ordinal distance information rather than numerical distance measurements. By ordinal distance information we refer to binary answers to distance comparisons such as d(A,B) < d(C,D). For many problems in machine learning and statistics it is unclear how to solve them in such a scenario. Up to now, the main approach...
متن کاملJaime dos Santos Cardoso Classification of Ordinal Data
Predictive learning has traditionally been a standard inductive learning, where different subproblem formulations have been identified. One of the most representative is classification, consisting on the estimation of a mapping from the feature space into a finite class space. Depending on the cardinality of the finite class space we are left with binary or multiclass classification problems. F...
متن کامل